Pancyclicity in Faulty K-ary 2-cubes
نویسندگان
چکیده
We prove that a k-ary 2-cube Q2 with 3 faulty edges but where every vertex is incident with at least 2 healthy edges is bipancyclic, if k ≥ 3, and k-pancyclic, if k ≥ 5 is odd (these results are optimal).
منابع مشابه
Embedding long cycles in faulty k-ary 2-cubes
The class of k-ary n-cubes represents the most commonly used interconnection topology for distributed-memory parallel systems. Given an even k P 4, let (V1,V2) be the bipartition of the k-ary 2-cube, fv1, fv2 be the numbers of faulty vertices in V1 and V2, respectively, and fe be the number of faulty edges. In this paper, we prove that there exists a cycle of length k 2max{fv1, fv2} in the k-ar...
متن کاملEmbeddings of hamiltonian paths in faulty k-ary 2-cubes
It is well known that the k-ary n-cube has been one of the most efficient interconnection networks for distributed-memory parallel systems. A k-ary n-cube is bipartite if and only if k is even. Let (X,Y ) be a bipartition of a k-ary 2-cube (even integer k ≥ 4). In this paper, we prove that for any two healthy vertices u ∈ X, v ∈ Y , there exists a hamiltonian path from u to v in the faulty k-ar...
متن کاملNode-pancyclicity and edge-pancyclicity of hypercube variants
Twisted cubes, crossed cubes, Möbius cubes, and locally twisted cubes are some of the widely studied hypercube variants. The 4-pancyclicity of twisted cubes, crossed cubes, Möbius cubes, locally twisted cubes and the 4-edgepancyclicity of crossed cubes are proven in [2, 1, 5, 10, 6] respectively. It should be noted that 4-edge-pancyclicity implies 4-node-pancyclicity which further implies 4-pan...
متن کاملHamiltonian circuit and linear array embeddings in faulty k-ary n-cubes
In this paper, we investigate the fault-tolerant capabilities of the k-ary n-cubes for even integer k with respect to the hamiltonian and hamiltonian-connected properties. The k-ary n-cube is a bipartite graph if and only if k is an even integer. Let F be a faulty set with nodes and/or links, and let k 3 be an odd integer. When |F | 2n−2, we show that there exists a hamiltonian cycle in a wound...
متن کاملParallel Hermite Interpolation on Faulty K-ary n-cubes Network
In this paper a parallel algorithm is developed for Hermite Interpolation k-ary n-cube network. The algorithm involves three phases: initial phase; main phase and final phase. The computational statistics for the parallel algorithm are also discussed. For N = k points Hermite Interpolation the parallel algorithm in worst case involves N/2 data communications, 2N+6 multiplications , 2N+3 subtrac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009